منابع مشابه
Exact Algorithms for Annotated Edge Dominating Set in Cubic Graphs
Given a graph G = (V,E) together with a nonnegative integer requirement on vertices r : V → Z+, the annotated edge dominating set problem is to find a minimum set M ⊆ E such that, each edge in E −M is adjacent to some edge in M , and M contains at least r(v) edges incident on each vertex v ∈ V . The annotated edge dominating set problem is a natural extension of the classical edge dominating se...
متن کاملDesign by Measure and Conquer: Exact algorithms for dominating set
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we propose to use measure and conquer also as a tool in the design of algorithms. In an iterative process, we obtain a series of branch and reduce algorithms. A mathematical analysis of an algorithm in the series with m...
متن کاملExact (Exponential) Algorithms for the Dominating Set Problem
We design fast exact algorithms for the problem of computing a minimum dominating set in undirected graphs. Since this problem is NP-hard, it comes with no big surprise that all our time complexities are exponential in the number n of vertices. The contribution of this paper are ‘nice’ exponential time complexities that are bounded by functions of the form c with reasonably small constants c < ...
متن کاملSemidefinite relaxation for dominating set
‎It is a well-known fact that finding a minimum dominating set and consequently the domination number of a general graph is an NP-complete problem‎. ‎In this paper‎, ‎we first model it as a nonlinear binary optimization problem and then extract two closely related semidefinite relaxations‎. ‎For each of these relaxations‎, ‎different rounding algorithm is exp...
متن کاملExact Algorithms for Dominating Clique Problems
We handle in this paper three dominating clique problems, namely, the decision problem itself when one asks if there exists a dominating clique in a graph G and two optimization versions where one asks for a maximumand a minimum-size dominating clique, if any. For the three problems we propose optimal algorithms with provably worst-case upper bounds improving existing ones by (D. Kratsch and M....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2011
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.07.001